Schema mapping generation in the wild

The Inverse of a Schema Mapping

The inversion of schema mappings has been identified as one of the fundamental operators for the development of a general framework for data exchange, data integration, and more generally, for metadata management. Given a mappingM from a schema S to a schema T, an inverse ofM is a new mapping that describes the reverse relationship from T to S, and that is semantically consistent with the relat...

Schema Mapping as Query Discovery

Designing a Knowledge-based Schema Matching System for Schema Mapping

Schema mapping that provides a unified view to the users is necessary to manage schema heterogeneity among different data sources. Schema matching is a required task for schema mapping that finds semantic correspondences between entity pairs of schemas. Semi-automatic schema matching systems were developed to overcome manual works for schema mapping. However, such approaches require a high manu...

Λ Φ I A Abstraction Mapping Implementation Mapping Q Q ’ Logical Schema Physical Schema

We present an optimization method and algorithm designed for three objectives: physical data independence, semantic optimization, and generalized tableau minimization. The method relies on generalized forms of chase and \backchase" with constraints (dependencies). By using dictionaries ((nite functions) in physical schemas we can capture with constraints useful access structures such as indexes...

Distributed Key Generation in the Wild

Distributed key generation (DKG) has been studied extensively in the cryptographic literature. However, it has never been examined outside of the synchronous setting, and the known DKG protocols cannot guarantee safety or liveness over the Internet. In this work, we present the first realistic DKG protocol for use over the Internet. We propose a practical system model for the Internet and defin...